3-regular graphs are 2-reconstructible
نویسندگان
چکیده
Abstract A graph is l -reconstructible if it determined by its multiset of induced subgraphs obtained deleting vertices. We prove that 3-regular graphs are 2-reconstructible.
منابع مشابه
Small graphs are reconstructible
With the help of a novel computational technique, we show that graphs with up to 11 vertices are determined uniquely by their sets of vertex-deleted subgraphs, even if the set of subgraphs is reduced by isomorphism type. The same result holds for triangle-free graphs to 14 vertices, square-free graphs to 15 vertices and bipartite graphs to 15 vertices, as well as some other classes.
متن کاملJ un 2 00 8 Classes of 3 - regular graphs that are ( 7 , 2 ) - edge - choosable
A graph is (7, 2)-edge-choosable if, for every assignment of lists of size 7 to the edges, it is possible to choose two colors for each edge from its list so that no color is chosen for two incident edges. We show that every 3-edge-colorable graph is (7, 2)-edge-choosable and also that many non-3-edge-colorable 3-regular graphs are (7, 2)-edge-choosable.
متن کاملRegular Graphs are Antimagic
In this note we prove with a slight modification of an argument of Cranston et al. [2] that k-regular graphs are antimagic for k ≥ 2.
متن کامل5-Regular Graphs are 3-Colorable with Positive Probability
We show that uniformly random 5-regular graphs of n vertices are 3-colorable with probability that is positive independently of n.
متن کاملEdge-distance-regular graphs are distance-regular
A graph is edge-distance-regular when it is distance-regular around each of its edges and it has the same intersection numbers for any edge taken as a root. In this paper we give some (combinatorial and algebraic) proofs of the fact that every edge-distance-regular graph Γ is distance-regular and homogeneous. More precisely, Γ is edge-distance-regular if and only if it is bipartite distance-reg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2021
ISSN: ['1095-9971', '0195-6698']
DOI: https://doi.org/10.1016/j.ejc.2020.103216